Hiding the weights—CBC black box algorithms with a guaranteed error bound
نویسندگان
چکیده
منابع مشابه
Loss Minimization of Power Distribution Networks with Guaranteed Error Bound
Determining loss minimum configuration in a distribution network is a hard discrete optimization problem involving many variables. Since more and more dispersed generators are installed on the demand side of power systems and they are reconfigured frequently, developing automatic approaches is indispensable for effectively managing a large-scale distribution network. Existing fast methods emplo...
متن کاملBalanced Truncation for Stochastic Linear Systems with Guaranteed Error Bound
We consider model order reduction of stochastic linear systems by balanced truncation. Two types of Gramians are suggested, both satisfying generalized Lyapunov equations. The first is motivated by energy functionals, the second is taylored to yield an error bound for the truncated system.
متن کاملEffective Black-Box Testing with Genetic Algorithms
Black-box (functional) test cases are identified from functional requirements of the tested system, which is viewed as a mathematical function mapping its inputs onto its outputs. While the number of possible black-box tests for any non-trivial program is extremely large, the testers can run only a limited number of test cases under their resource limitations. An effective set of test cases is ...
متن کاملHeuristics for Faster Error Detection With Automated Black Box Testing
Three building blocks for test guidance algorithms, the step evaluation, the state evaluation and the evaluation order, are proposed in this paper. We show how a simple family of coverage criteria can be used to evaluate individual testing steps, and how the nondeterministic behaviour of the tested system can be handled and longer term test step plans created with the state evaluation. We use t...
متن کاملEvaluating a constant expression in multiple precision with a guaranteed error bound
The evaluation of special functions often involves the evaluation of numerical constants. When the precision of the evaluation is known in advance (e.g., when developing libms) these constants are simply precomputed once for a while. In contrast, when the precision is dynamically chosen by the user (e.g., in multiple precision libraries), the constants must be evaluated on the fly at the requir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Computers in Simulation
سال: 2018
ISSN: 0378-4754
DOI: 10.1016/j.matcom.2016.06.005